Compositional Explanations is a method for identifying logical formulas of concepts that approximate the neurons' behavior. However, these explanations are linked to the small spectrum of neuron activations (i.e., the highest ones) used to check the alignment, thus lacking completeness. In this paper, we propose a generalization, called Clustered Compositional Explanations, that combines Compositional Explanations with clustering and a novel search heuristic to approximate a broader spectrum of the neuron behavior. We define and address the problems connected to the application of these methods to multiple ranges of activations, analyze the insights retrievable by using our algorithm, and propose desiderata qualities that can be used to study the explanations returned by different algorithms.
Towards a fuller understanding of neurons with Clustered Compositional Explanations / La Rosa, Biagio; Gilpin, Leilani H.; Capobianco, Roberto. - 36:(2023), pp. 70333-70354. ( Thirty-seventh Annual Conference on Neural Information Processing Systems 37th Conference on Neural Information Processing Systems, NeurIPS 2023 ).
Towards a fuller understanding of neurons with Clustered Compositional Explanations
Biagio La Rosa
Primo
Conceptualization
;Roberto Capobianco
Ultimo
Supervision
2023
Abstract
Compositional Explanations is a method for identifying logical formulas of concepts that approximate the neurons' behavior. However, these explanations are linked to the small spectrum of neuron activations (i.e., the highest ones) used to check the alignment, thus lacking completeness. In this paper, we propose a generalization, called Clustered Compositional Explanations, that combines Compositional Explanations with clustering and a novel search heuristic to approximate a broader spectrum of the neuron behavior. We define and address the problems connected to the application of these methods to multiple ranges of activations, analyze the insights retrievable by using our algorithm, and propose desiderata qualities that can be used to study the explanations returned by different algorithms.| File | Dimensione | Formato | |
|---|---|---|---|
|
LaRosa_Towards-a-fuller_2023.pdf
solo gestori archivio
Note: https://dl.acm.org/doi/10.5555/3666122.3669204
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.35 MB
Formato
Adobe PDF
|
1.35 MB | Adobe PDF | Contatta l'autore |
|
LaRosa_preprint_Towards-a-fuller_2023.pdf
accesso aperto
Note: https://dl.acm.org/doi/10.5555/3666122.3669204
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Creative commons
Dimensione
1.43 MB
Formato
Adobe PDF
|
1.43 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


